Stirling networks: a versatile combinatorial topology for multiprocessor systems
نویسندگان
چکیده
منابع مشابه
Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems
We derive a family of labeled, undirected graphs from the Stirling table of the rst kind and investigate properties of these graphs as a basis for multiprocessor interconnection networks. The diameter of a Stirling network with n nodes is dlog2(n + 1)e 1, the average distance is less than 10/3, and the number of links is O(n1:59). Stirling networks can be inductively speci ed with incrementabil...
متن کاملRTMultiSim: A Versatile Simulator for Multiprocessor Real-Time Systems
This paper presents a simulation tool that can be used for the evaluation of real-time behavior for a wide range of parallel and distributed systems. The simulator is based on a flexible workload and CPU/execution model that covers different multiprocessor scenarios, from parallel systems and independent task sets to distributed environments and task sequences (transactions). The simulator may ...
متن کاملNano-gels: A versatile nano -carrier platform for drug delivery systems: A mini review
Nowadays the application of nanotechnology in different biomedical fields such as drug delivery is increasing due to its unique advantages. With this in mind, it is widely believed that nanogels as the nanometer-sized networked polymeric particles have a considerable impact on drug delivery systems as biocompatible nanocarriers due to their unique characteristics such as high loading capacity, ...
متن کاملPetersen-Twisted-Torus Networks for Multiprocessor Systems
Petersen-Gaussian (PG) networks are a broad family of interconnection networks for multi processor systems proposed recently. In this paper, a special case of PG networks, called PetersenTwisted-Torus (PTT) network, is considered. We analyze the diameter of PTT network, and find that PTT has smaller diameter and lower costing requirement than the well-known honeycomb mesh, diagonal mesh, torus,...
متن کاملA Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90128-w